Discrete Chebyshev Polynomials for Solving Fractional Variational Problems

In ‎the current study, a‎ general formulation of the discrete Chebyshev polynomials is given. ‎The operational matrix fractional integration for these also derived. ‎Then,‎ a numerical scheme based on and their has been developed to solve variational problems‎. this method, need using Lagrange multiplier during solution procedure eliminated.‎ The performance proposed validated through some illustrative examples. ‎Moreover, obtained results ‎‎‎‎were compared previously acquired by classical polynomials. Finally, comparison required CPU time presented, which indicates more efficiency less complexity method.